A Class of Methods Using Interval Arithmetic Operations for Solving Multi–Objective Interval Transportation Problems
نویسندگان
چکیده
The objective of this article is studying on cost and time minimization interval transportation problem (ITP) by using Best Candidate Method (BCM), Improved ASM method (IASM), method, Zero Suffix (ZSM) Point (ZPM) with new arithmetic operations. We have obtained a better optimum result campared existing methods available in the literature. problems considered are solved above listed without converting them into classical problems. A comparative results also given.
منابع مشابه
Solving discrete minimax problems using interval arithmetic
We present an interval algorithm for solving discrete minimax problems where the constituent minimax functions are continuously differentiable functions of one real variable. Our approach is based on smoothing the max-type function by exploiting the Jaynes’s maximum entropy [Phys. Rev., 106:620–630, 1957]. The algorithm works within the branchand-bound framework and uses first order information...
متن کاملSolving Multiobjective Linear Programming Problem Using Interval Arithmetic
Abstract In the real world, we often encounter cases where the information / data items can’t be determined with certainty. Hence the value of the datum in the data is assessed using an interval. Meanwhile multiobjective linear programming model is more adequate to describe the problem in the real world. Thus, the multiobjective linear programming problem will be developed into a multiobjective...
متن کاملSolving Decidability Problems with Interval Arithmetic
An affine iterated function system (IFS, [4]) over the reals is given by a set of contractive affine transformations on a complete metric space R for some positive natural number k. Thus an interesting problem is to decide, whether a given matrix M describes a contraction mapping, i.e. whether there exists some s < 1 such that |Mz| ≤ s|z| for each z ∈ R, where | · | denotes the Euclidean norm. ...
متن کاملResolution of nonlinear interval problems using symbolic interval arithmetic
An interval problem is a problem where the unknown variables take interval values. Such a problem can be defined by interval constraints, such as "the interval [a, b] ⊂ [a, b]2". Interval problems often appear when we want to analyze the behavior of an interval solver. To solve interval problems, we propose to transform the constraints on intervals into constraints on their bounds. For instance...
متن کاملDinkelbach Approach for Solving Interval-valued Multiobjective Fractional Programming Problems using Goal Programming
This paper presents an interval valued goal programming approach for solving multiobjective fractional programming problems. In the model formulation of the problem, the interval-valued system constraints are converted in to equivalent crisp system. The interval valued fractional objective goals are transformed into linear goals by employing the iterative parametric method which is an extension...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pakistan Journal of Statistics and Operation Research
سال: 2023
ISSN: ['1816-2711', '2220-5810']
DOI: https://doi.org/10.18187/pjsor.v19i3.3983